Automatic Verification of Acquisti Voting Protocol in Formal Model
نویسندگان
چکیده
In this paper Acquisti voting protocol is modeled in applied pi calculus. Soundness and coercion-resistance are verified with the automatic tool ProVerif. The result shows that Acquisti protocol has the soundness and coercion-resistance in some conditions. To our best knowledge, the first automatic analysis of Acquisti protocol for an unbounded number of honest and corrupted voters is
منابع مشابه
Receipt-Free Homomorphic Elections and Write-in Voter Verified Ballots
We present a voting protocol that protects voters’ privacy and achieves universal verifiability, receipt-freeness, and uncoercibility without ad hoc physical assumptions or procedural constraints (such as untappable channels, voting booths, smart cards, third-party randomizers, and so on). We discuss under which conditions the scheme allows voters to cast write-in ballots, and we show how it ca...
متن کاملAutomatic Verification of Security Properties in Remote Internet Voting Protocol with Applied Pi Calculus
Soundness and coercion resistance are the important and intricate security requirements for remote voting protocols. Several formal models of soundness and coercion-resistance have been proposed in the literatures, but these formal models are not supported by automatic tools. Recently Backes et al. propose a new formal automated model of security properties including soundness and coercionresis...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملReceipt-Free Homomorphic Elections and Write-in Ballots
Abstract. We present a voting protocol that protects voters’ privacy and achieves universal verifiability, receipt-freeness, and uncoercibility without ad hoc physical assumptions or procedural constraints (such as untappable channels, voting booths, smart cards, third-party randomizers, and so on). We discuss under which conditions the scheme allows voters to cast write-in ballots, and we show...
متن کاملMechanized Proof of Resistance of Denial of Service Attacks in Voting Protocol with ProVerif
Resistance of denial of service attacks is a key security requirement in voting protocols. Acquisti protocol plays an important role in development of internet voting protocols and claims its security without strong physical assumptions. In this study firstly Acquisti protocol is modeled in extended applied pi calculus, and then resistance of denial of service attacks is proved with ProVerif. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010